The Robber Locating game

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Robber Locating game

In 2012 Seager introduced a new variant of the Cops and Robbers game, in which a cop searches for a moving robber on a graph using distance probes. The robber on his turn can either remain still or move to an adjacent vertex, while the cop on her turn probes any vertex and learns the robber’s distance from the probed vertex. Carraher, Choi, Delcourt, Erickson and West later showed that for any ...

متن کامل

A robber locating strategy for trees

The robber locating game, introduced by Seager in [8], is a variation of the classic cops and robbers game on a graph. A cop attempts to locate an invisible robber on a graph by probing a single vertex v each turn, from which the cop learns the robber’s distance. The robber is then permitted to stay at his current vertex or move to an adjacent vertex other than v. A graph is locatable if the co...

متن کامل

Locating a robber on a graph

Consider the following game of a cop locating a robber on a connected graph. At each turn, the cop chooses a vertex of the graph to probe and receives the distance from the probe to the robber. If she can uniquely locate the robber after this probe, then she wins. Otherwise the robber may either stay put or move to any vertex adjacent to his location other than the probe vertex. The cop’s goal ...

متن کامل

Locating a robber on a graph via distance queries

A cop wants to locate a robber hiding among the vertices of a graph. A round of the game consists of the robber moving to a neighbor of its current vertex (or not moving) and then the cop scanning some vertex to obtain the distance from that vertex to the robber. If the cop can at some point determine where the robber is, then the cop wins; otherwise, the robber wins. We prove that the robber w...

متن کامل

Cop and robber game and hyperbolicity

In this note, we prove that all cop-win graphs G in the game in which the robber and the cop move at different speeds s and s′ with s′ < s, are δ-hyperbolic with δ = O(s). We also show that the dependency between δ and s is linear if s − s′ = Ω(s) and G obeys a slightly stronger condition. This solves an open question from the paper J. Chalopin et al., Cop and robber games when the robber can h...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2016

ISSN: 0012-365X

DOI: 10.1016/j.disc.2015.07.018